Iterative optimization for the data center

Iterative pass optimization of sequence data.

The problem of determining the minimum-cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete. This "tree alignment" problem has motivated the considerable effort placed in multiple sequence alignment procedures. Wheeler in 1996 proposed a heuristic method, direct optimization, to calculate cladogram costs without the intervention of multiple sequence alignment. ...

Iterative Methods for Optimization

An Online Energy Saving Resource Optimization Methodology for Data Center

In order to reduce energy consumption of data centers while employing infrastructure resource effectively, a comprehensive resource management method using an improved online energy saving mapping algorithm for virtual machines of data centers is proposed. An intelligent feedback management framework is built for online resource optimization. We propose reinforcement learning and threshold base...

Routing optimization for server-centric data center networks

Server-centric data center architecture has been proposed to provide high throughput, scalable construction and error tolerance with commodity servers and switches for cloud data centers. To fully utilize those advantages of servercentric data center, an effective routing algorithm to find high quality multiple paths in Server-centric network is needed. However, current routing algorithms canno...

Iterative procedure for the generalized graph center in polycyclic graphs

An improvement in the algorithm for assigning vertex(es) as graph center(s) is achieved on the basis of the distances between vertexes and between edges, as well as proceeding from the vertex-edge incidence. The iterative vertex and edge centricities (IVEC) algorithm produces assignments that are in better agreement with the intuitive notion of graph center than those produced by the previous p...